Tree-Shaped Facility Location Problems and the Relationship with the Knapsack Problems
نویسندگان
چکیده
The tree-shaped facility location problem aims to locate a subtree on the center of a given tree network. This paper deals with four types of the problems in which the centrality for a subtree is measured by the eccentricity or the distance-sum, and a subtree may contain partial edges or not. We investigate the relationship between these problems and knapsack-type problems. The relation leads to a linear-time algorithm for a tree-shaped facility location problem which is known to be polynomial-time solvable, or an approximation algorithm for the one which is NP-hard.
منابع مشابه
Inverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملHierarchical Facility Location and Hub Network Problems: A literature review
In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...
متن کاملSingle Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions
Location theory is an interstice field of optimization and operations research. In the classic location models, the goal is finding the location of one or more facilities such that some criteria such as transportation cost, the sum of distances passed by clients, total service time, and cost of servicing are minimized. The goal Weber location problem is a special case of location mode...
متن کاملHalf-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
In this paper, we establish a novel duality relationship between node-capacitated multiflows and tree-shaped facility locations. We prove that the maximum value of a tree-distance-weighted maximum node-capacitated multiflow problem is equal to the minimum value of the problem of locating subtrees in a tree, and the maximum is attained by a half-integral multiflow. Utilizing this duality, we sho...
متن کاملHeuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کامل